Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
نویسندگان
چکیده
منابع مشابه
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability. In this paper, we consider PDE-constrained optimization problems with bound constraints on the state and control variables, and their representation on the discrete level as quadratic programming problems. To...
متن کاملOn the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization Equality Constrained Quadratic Programming Problems Arising in Optimization
We consider the application of the conjugate gradient method to the solution of large equality constrained quadratic programs arising in nonlinear optimization. Our approach is based on a reduced linear system and generates iterates in the null space of the constraints. Instead of computing a basis for this null space, we choose to work directly with the matrix of constraint gradients, computin...
متن کاملInterior-Point Methods for PDE-Constrained Optimization
In applied sciences PDEs model an extensive variety of phenomena. Typically the final goal of simulations is a system which is optimal in a certain sense. For instance optimal control problems identify a control to steer a system towards a desired state. Inverse problems seek PDE parameters which are most consistent with measurements. In these optimization problems PDEs appear as equality const...
متن کاملRAL-TR-1998-069 On the solution of equality constrained quadratic programming problems arising in optimization
We consider the application of the conjugate gradient method to the solution of large equality constrained quadratic programs arising in nonlinear optimization. Our approach is based on a reduced linear system and generates iterates in the null space of the constraints. Instead of computing a basis for this null space, we choose to work directly with the matrix of constraint gradients, computin...
متن کاملOn the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
We consider the application of the conjugate gradient method to the solution of large equality constrained quadratic programs arising in nonlinear optimization Our approach is based implicitly on a reduced linear system and generates iterates in the null space of the constraints Instead of computing a basis for this null space we choose to work directly with the matrix of constraint gradients c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2017
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-017-0892-8